Nearly optimal FIFO buffer management for two packet classes
نویسندگان
چکیده
منابع مشابه
Nearly optimal FIFO buffer management for two packet classes q
We consider a FIFO buffer with finite storage space. An arbitrary input stream of packets arrives at the buffer, but the output stream rate is bounded, so overflows may occur. We assume that each packet has value which is either 1 or a, for some a > 1. The buffer management task is to decide which packets to drop so as to minimize the total value of lost packets, subject to the buffer space bou...
متن کاملNearly optimal FIFO buffer management for two packet classes
We consider a FIFO buffer with finite storage space. An arbitrary input stream of packets arrives at the buffer, but the output stream rate is bounded, so overflows may occur. We assume that each packet has value which is either 1 or a, for some a > 1. The buffer management task is to decide which packets to drop so as to minimize the total value of lost packets, subject to the buffer space bou...
متن کاملA Near-Optimal Memoryless Online Algorithm for FIFO Buffering Two Packet Classes
We consider scheduling packets with values in a capacity-bounded buffer in an online setting. In this model, there is a buffer with limited capacity B. At any time, the buffer cannot accommodatemore than B packets. Packets arrive over time. Each packet has a nonnegative value. Packets leave the buffer only because they are either sent or dropped. Those packets that have left the bufferwill not ...
متن کاملComparison-Based FIFO Buffer Management in QoS Switches
The following online problem arises in network devices, e.g., switches, with quality of service (QoS) guarantees. In each time step, an arbitrary number of packets arrive at a single FIFO buffer and only one packet can be transmitted. Packets may be kept in the buffer of limited size and, due to the FIFO property, the sequence of transmitted packets has to be a subsequence of the arriving packe...
متن کاملOn two classes of nearly binary matroids
We give an excluded-minor characterization for the class of matroids M in which M\e or M/e is binary for all e in E(M). This class is closely related to the class of matroids in which every member is binary or can be obtained from a binary matroid by relaxing a circuithyperplane. We also provide an excluded-minor characterization for the second class.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Networks
سال: 2003
ISSN: 1389-1286
DOI: 10.1016/s1389-1286(03)00197-x